Incremental maintenance of overgrounded logic programs with tailored simplifications
نویسندگان
چکیده
منابع مشابه
Incremental Analysis of Logic Programs
Global analyzers traditionally read and analyze the entire program at once, in a non-incremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears ineecient to perform the analysis of the program again from scratch, as needs to be do...
متن کاملIncremental Maintenance of dynamic Datalog programs
This paper is an extended abstract of [5], which discusses the incremental maintenance of materialized ontologies in a rule-enabled Semantic Web. The reader may wonder how this relates to Datalog, a language that has been proposed in the deductive database context. However, the semantics underlying Web ontology languages can often be realized by translating the ontology into appropriate Datalog...
متن کاملIncremental Learning of Functional Logic Programs
In this work, we consider the extension of the Inductive Functional Logic Programming (IFLP) framework in order to learn functions in an incremental way. In general, incremental learning is necessary when the number of examples is infinite, very large or presented one by one. We have performed this extension in the FLIP system, an implementation of the IFLP framework. Several examples of progra...
متن کاملIncremental Evaluation of Tabled Logic Programs
Tabling has emerged as an important evaluation technique in logic programming. Currently, changes to a program (due to addition/deletion of rules/facts) after query evaluation compromise the completeness and soundness of the answers in the tables. This paper presents incremental algorithms for maintaining the freshness of tables upon addition or deletion of facts. Our algorithms improve on exis...
متن کاملIncremental Computation of Success Patterns of Logic Programs
ions, that the set of success patterns of a logic program P with respect to an abstraction α is tantamount to the success set of the equational logic program where Eα is an equality theory induced by α. Therefore, either the fixpoint semantics or the procedural semantics defined for equational logic programs can be used to compute success patterns of logic programs. From this observation, the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2020
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s147106842000040x